Computationally Efficient Cepstral Domain Feature Compensation
نویسندگان
چکیده
منابع مشابه
Computationally Efficient Cepstral Domain Feature Compensation
In this letter, we propose a novel approach to feature compensation performed in the cepstral domain. Processing in the cepstral domain has the advantage that the spectral correlation among different frequencies is taken into consideration. By introducing a linear approximation with diagonal covariance assumption, we modify the conventional log-spectral domain feature compensation technique to ...
متن کاملFeature compensation in the cepstral domain employing model combination
In this paper, we present an effective cepstral feature compensation scheme which leverages knowledge of the speech model in order to achieve robust speech recognition. In the proposed scheme, the requirement for a prior noisy speech database in off-line training is eliminated by employing parallel model combination for the noise-corrupted speech model. Gaussian mixture models of clean speech a...
متن کاملCepstral domain talker stress compensation for robust speech recognition
Automatic speech recognition algorithms generally rely on the assumption that for the distance measure used, intraword variabilities are smaller than interword variabilities so that appropriate separation in the measurement space is possible. As evidenced by degradation of recognition performance, the validity of such an assumption decreases from simple tasks to complex tasks, from cooperative ...
متن کاملComputationally efficient and robust frequency-domain GSC
In this paper, we propose a novel adaptive beamforming algorithm with low signal distortion capability and high computational efficiency. The proposed algorithm incorporates the crosstalk-resistant adaptive noise canceller (CTRANC) in place of the usual adaptive interference canceller (AIC). Doing so, a better signal leakage estimate is provided at the adaptive interference canceller input but ...
متن کاملCepstral Compensation Using Statistical Linearization
Speech recognition systems perform poorly on speech degraded by even simple effects such as linear filtering and additive noise. One solution to this problem is to modify the probability density function (PDF) of clean speech to account for the effects of the degradation. However, even for the case of linear filtering and additive noise, it is extremely difficult to do this analytically. Previo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2009
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e92.d.86